Optimising minimal Herbrand model generation procedures
نویسنده
چکیده
In this paper we develop efficient minimal Herbrand model generation procedures for decidable by hyperresolution syntactically defined clausal classes, clausal classes rendered by formulae in first-order logic and clausal classes rendered by formulae in description and modal logics. The procedures use complement splitting and a restricted application of either model constraint propagation rule or local minimality test and consequently optimise known minimal Herbrand model generation procedures.
منابع مشابه
Institut F Ur Informatik Lehr-und Forschungseinheit F Ur Programmier-und Modellierungssprachen Oettingenstraae 67, D{80538 M Unchen Positive Unit Hyper-resolution Tableaux for Minimal Model Generation Positive Unit Hyper-resolution Tableaux for Minimal Model Generation
Minimal Herbrand models for clausal theories are useful in several areas of computer science, e.g. automated theorem proving, program veriication, logic programming, databases, and artiicial intelligence. In most cases, the conventional model generation algorithms are inappropriate because they generate nonminimal Herbrand models and can be ineecient. This article describes a novel approach for...
متن کاملComputational Space Efficiency and Minimal Model Generation for Guarded Formulae
This paper describes a number of hyperresolution-based decision procedures for a subfragment of the guarded fragment. We first present a polynomial space decision procedure of optimal worst-case space and time complexity for the fragment under consideration. We then consider minimal model generation procedures which construct all and only minimal Herbrand models for guarded formulae. These proc...
متن کاملInstitut F Ur Informatik Lehr-und Forschungseinheit F Ur Programmier-und Modellierungssprachen Oettingenstraae 67, D{80538 M Unchen Minimal Model Generation with Positive Unit Hyper-resolution Tableaux Minimal Model Generation with Positive Unit Hyper-resolution Tableaux
Herbrand models for clausal theories are useful in several areas of computer science. In most cases, however, the conventional model generation algorithms are inappropriate because they generate non-minimal Herbrand models and can be ineecient. This article describes a novel approach for generating minimal Herbrand models of clausal theories. The approach builds upon positive unit hyper-resolut...
متن کاملMixed Fixpoint Theory for Disjunktive Deductive Databases
This paper deals with state generation and model generation for minimal model reasoning. We review the xpoint theory of two immediate consequence operators for databases, cf. also LoMiRa 92] and Fe 93], and prove some useful connections between them. For positive-disjunctive databases D, the rst operator T s D is based on hyperresolution. It operates on disjunctice Herbrand states and its least...
متن کاملA New Clausal Class Decidable by Hyperresolution
In this paper we define a new clausal class, called BU , which can be decided by hyperresolution with splitting. We also consider the model generation problem for BU and show that hyperresolution plus splitting can also be used as a Herbrand model generation procedure for BU and, furthermore, that the addition of a local minimality test allows us to generate only minimal Herbrand models for cla...
متن کامل